Ordering unicyclic graphs with large average eccentricities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordering Unicyclic Graphs with Respect to F-index

F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest F-indices and the unicyclic graphs with the first two smallest F-indices, respectively.

متن کامل

Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues

Let G be a simple graph with n vertices, and let A be the 0, 1 -adjacency matrix of G. We call det λI −A the characteristic polynomial of G, denoted by P G; λ , or abbreviated P G . Since A is symmetric, its eigenvalues λ1 G , λ2 G , . . . , λn G are real, and we assume that λ1 G ≥ λ2 G ≥ · · · ≥ λn G . We call λn G the least eigenvalue of G. Up to now, some good results on the least eigenvalue...

متن کامل

Ordering of the signless Laplacian spectral radii of unicyclic graphs

For n ≥ 11, we determine all the unicyclic graphs on n vertices whose signless Laplacian spectral radius is at least n− 2. There are exactly sixteen such graphs and they are ordered according to their signless Laplacian spectral radii.

متن کامل

Unicyclic graphs with maximal energy

Let G be a graph on n vertices and let λ1, λ2, . . . , λn be its eigenvalues. The energy of G is defined as E(G) = |λ1| + |λ2| + · · · + |λn|. For various classes of unicyclic graphs, the graphs with maximal energy are determined. Let P 6 n be obtained by connecting a vertex of the circuit C6 with a terminal vertex of the path Pn−6. For n 7, P 6 n has the maximal energy among all connected unic...

متن کامل

Ordering a class of unicyclic graphs with respect to Merrifield-Simmons index

The Merrifield-Simmons index is one of the most popular topological indices in chemistry and in mathematical properties; there is a correlation between this index and boiling points. The MerrifieldSimmons index of a graph is defined as the total number of its independent sets, including the empty set. This paper proposed an edge grafting theorem operation, which is certain kind of edge moving b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2014

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil1401207t